- 1 - a Three Color Problem
نویسندگان
چکیده
J.BSTllCT It is well-known that the problem of determining whether a planar map is three-colorable is NP-complete. There are also several isolated results on three-colorability for certain classes of maps. Herein, we consider. a new class of maps that consists of those involving lines and half-lines. It is shown that such maps are three-colorable if they satisfy a simple condition. An extension to curved lines is also considered.
منابع مشابه
Video-based face recognition in color space by graph-based discriminant analysis
Video-based face recognition has attracted significant attention in many applications such as media technology, network security, human-machine interfaces, and automatic access control system in the past decade. The usual way for face recognition is based upon the grayscale image produced by combining the three color component images. In this work, we consider grayscale image as well as color s...
متن کاملInstrument dependency of Kubelka-Munk theory in computer color matching
Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...
متن کاملThe Three-Color and Two-Color Tantrix Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Holzer and Holzer [HH04] proved the Tantrix rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix rotation puzzle problem is DP-complete under ...
متن کاملاندازهگیری و مقایسه ابعاد مختلف رنگ منتج از دو نوع آلیاژ بیس‌متال در دیسک‌های سرامومتال
Statement of Problem: Color matching and accurate shade selection are the challenging problems common to restorative dentistry. In ceramometal restorations, the type of substructure alloy affects the final color of bonded porcelain. Nickel- chromium alloy is the most commonly used one that its Iranian product, namely Minalux, is similar to Verabond2.Purpose: The aim of this study was to assess ...
متن کاملSubband/VQ coding of color images with perceptually optimal bit allocation
The combination of subband coding and vector quantization can provide a powerful method for compressing color images. The use of properties of the human visual system can increase the performance of such a system and allow one to achieve very high quality reconstructed images at compression ratios exceeding 10:1. In this paper, we design a color subband-vector quantization system, and formulate...
متن کاملColor scales that are effective in both color and grayscale
We consider the problem of finding a color scale which performs well when converted to a grayscale. We assume that each color is converted to a shade of gray with the same intensity as the color. We also assume that the color scales have a linear variation of intensity and hue, and find scales which maximize the average chroma (or “colorfulness”) of the colors. We find two classes of solutions,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008